Average number of messages for distributed leader-finding in rings of processors

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Average Number of Messages for Distributed Leader Finding in Rings of Processors

In the sequel, we consider the problem of finding a leader in an asynchronous bidirectional ring of processors. Each processor is distinguished by a unique identification number (its "identity"). There is no central controller and every processor has only locai information about the network, namely it only knows its direct neighbours in the distributed system. The problem is to design a distrib...

متن کامل

Exact Average Message Complexity Values for Distributed Election on Bidirectional Rings of Processors

Consider a distributed system of n processors arranged on a ring. All processors are labeled with distinct identity-numbers, but are otherwise identical. In this paper, we make use of combinatorial enumeration methods in permutations and derive the one and the same exact asymptotic value, lJ2nH,,+O(n), of the expected number of messages in both probabilistic and deterministicbidirectional varia...

متن کامل

study of cohesive devices in the textbook of english for the students of apsychology by rastegarpour

this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...

Minimizing the number of processors for real-time distributed systems

In this paper we present a new search method for partitioning and scheduling a set of periodic tasks on a multiprocessor or distributed architecture. The schedule is fixedpriority driven and task migration is not allowed. The aim of this algorithm is to minimize the number of processors used for scheduling a set of tasks. Moreover, we assume that the number of processors obtained by our method ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Processing Letters

سال: 1989

ISSN: 0020-0190

DOI: 10.1016/0020-0190(89)90208-1